IK-CPA security implies IE-CCA security in the random oracle model

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Security of Multiple Encryption or CCA-security+CCA-security=CCA-security?

In a practical system, a message is often encrypted more than once by different encryptions, here called multiple encryption, to enhance its security. Additionally, new features may be achieved by multiple encrypting a message, such as the key-insulated cryptosystems and anonymous channels. Intuitively, a multiple encryption should remain “secure”, whenever there is one component cipher unbreak...

متن کامل

Obfuscation ⇒ ( IND - CPA Security 6 ⇒ Circular Security )

Circular security is an important notion for public-key encryption schemes and is needed by several cryptographic protocols. In circular security the adversary is given an extra “hint” consisting of a cycle of encryption of secret keys i.e., (Epk1(sk2), . . . , Epkn(sk1)). A natural question is whether every IND-CPA encryption scheme is also circular secure. It is trivial to see that this is no...

متن کامل

Obfuscation ⇒ (IND-CPA Security !⇒ Circular Security)

Circular security is an important notion for public-key encryption schemes and is needed by several cryptographic protocols. In circular security the adversary is given an extra “hint” consisting of a cycle of encryption of secret keys i.e., (Epk1(sk2), . . . , Epkn(sk1)). A natural question is whether every IND-CPA encryption scheme is also circular secure. It is trivial to see that this is no...

متن کامل

CPA Security and Limitations

Consider Pr [ A( ,Uk,·) ( 1, E ( 1,Uk,m k )) = 1 ] for b = 0, 1 (we will refer to this as Pr [A0] and Pr [A1] for convenience). Suppose that the oracle is queried at most p (k) times for some polynomial p (k). The i-th time the oracle is queried, it picks some random c0 (call it ci,0) and then returns ci,0,Uk (ci,0) ⊕m. Let E be the event that ci,0 = c 0 for any i. Since each ci,0 is chosen at ...

متن کامل

Relations between semantic security and indistinguishability against cpa, non-adaptive cca and adaptive cca in comparison based framework

In this paper we try to unify the frameworks of definitions of semantic security, indistinguishability and non-malleability by defining semantic security in comparison based framework. This facilitates the study of relations among these goals against different attack models and makes the proof of the equivalence of semantic security and indistinguishability easier and more understandable. Besid...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Science China Information Sciences

سال: 2011

ISSN: 1674-733X,1869-1919

DOI: 10.1007/s11432-011-4370-0